Descent polynomials for kk bubble-sortable permutations of type B
نویسنده
چکیده
Motivated by the work of Chung, Claesson, Dukes, and Graham in [5], we define a natural type B analog of the classic bubble sort, and use it to define a type B analog of the maximum drop statistic. We enumerate (by explicit, recursive, and generating function formulas) signed permutations with r type B descents and type B maximum drop at most k. We also find a connection between these signed permutations and certain 2-colored juggling sequences.
منابع مشابه
On the Real-Rootedness of the Descent Polynomials of (n-2)-Stack Sortable Permutations
Bóna conjectured that the descent polynomials on (n−2)-stack sortable permutations have only real zeros. Brändén proved this conjecture by establishing a more general result. In this paper, we give another proof of Brändén’s result by using the theory of s-Eulerian polynomials recently developed by Savage and Visontai.
متن کاملRevstack Sort, Zigzag Patterns, Descent Polynomials of $t$-revstack Sortable Permutations, and Steingrímsson's Sorting Conjecture
In this paper we examine the sorting operator T (LnR) = T (R)T (L)n. Applying this operator to a permutation is equivalent to passing the permutation reversed through a stack. We prove theorems that characterise t-revstack sortability in terms of patterns in a permutation that we call zigzag patterns. Using these theorems we characterise those permutations of length n which are sorted by t appl...
متن کاملActions on permutations and unimodality of descent polynomials
We study a group action on permutations due to Foata and Strehl and use it to prove that the descent generating polynomial of certain sets of permutations has a nonnegative expansion in the basis {t(1 + t)} i=0 , m = ⌊(n−1)/2⌋. This property implies symmetry and unimodality. We prove that the action is invariant under stack-sorting which strengthens recent unimodality results of Bóna. We prove ...
متن کاملDescent polynomials for permutations with bounded drop size
Motivated by juggling sequences and bubble sort, we examine permutations on the set {1, 2, . . . , n} with d descents and maximum drop size k. We give explicit formulas for enumerating such permutations for given integers k and d. We also derive the related generating functions and prove unimodality and symmetry of the coefficients. Résumé. Motivés par les “suites de jonglerie” et le tri à bull...
متن کاملSorting and preimages of pattern classes
We introduce an algorithm to determine when a sorting operation, such as stack-sort or bubble-sort, outputs a given pattern. The algorithm provides a new proof of the description of West-2-stack-sortable permutations, that is permutations that are completely sorted when passed twice through a stack, in terms of patterns. We also solve the long-standing problem of describing West-3-stack-sortabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 34 شماره
صفحات -
تاریخ انتشار 2013